Approximation by neural networks with weights varying on a finite set of directions
نویسندگان
چکیده
منابع مشابه
FINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS
This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...
متن کاملOn the approximation by single hidden layer feedforward neural networks with fixed weights
Single hidden layer feedforward neural networks (SLFNs) with fixed weights possess the universal approximation property provided that approximated functions are univariate. But this phenomenon does not lay any restrictions on the number of neurons in the hidden layer. The more this number, the more the probability of the considered network to give precise results. In this note, we constructivel...
متن کاملOn Neural Networks with Minimal Weights
Linear threshold elements are the basic building blocks of artificial neural networks. A linear threshold element computes a function that is a sign of a weighted sum of the input variables. The weights are arbitrary integers; actually, they can be very big integers-exponential in the number of the input variables. However, in practice, it is difficult to implement big weights. In the present l...
متن کاملRational approximation with varying weights in the complex plane
Given an open bounded set G in the complex plane and a weight function W (z) which is analytic and di erent from zero in G, we consider the problem of locally uniform rational approximation of any function f(z), which is analytic in G, by particular ray sequences of weighted rational functions of the form Wm+n(z)Rm;n(z), where Rm;n(z) = Pm(z)=Qn(z); with deg Pm m and degQn n: The main result of...
متن کاملDetermining a common set of weights in DEA by solving a linear programming
In models of Data Envelopment Analysis (DEA), an optimal set of input and output weights is generally as-sumed to represent the assessed Decision Making Unit (DMU) in the best light in comparison to all the other DMUs. These sets of weights are, typically, different for each of the participating DMUs. Thus, it is important to find a Common Set of Weights (CSW) across the set of DMUs. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2012
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2011.11.037